Peg Solitaire on Cartesian Products of Graphs

Abstract In 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. same article, authors proved some results on solvability Cartesian products, given solvable or distance 2-solvable We extend these products certain unsolvable particular, we prove that ladders grid graphs are and, further, even product two stars, which in a sense “most”